Stability and Similarity of Link Analysis Ranking Algorithms
نویسندگان
چکیده
منابع مشابه
Stability and Similarity of Link Analysis Ranking Algorithms
Recently, there has been a surge of research activity in the area of link analysis ranking, where hyperlink structures are used to determine the relative authority of webpages. One of the seminal works in this area is that of Kleinberg [Kleinberg 98], who proposed the HITS algorithm. In this paper, we undertake a theoretical analysis of the properties of the HITS algorithm on a broad class of r...
متن کاملRank-Stability and Rank-Similarity of Web Link-Based Ranking Algorithms
The stability of Web link-based ranking algorithms was examined in recent works. Among the aspects investigated were the notions of rank stable algorithms and rank similar algorithms. Of special interest are stability results on a particular class of graphs, called authority connected graphs. This report considers three link-based ranking algorithms: PageRank, HITS and SALSA. We extend previous...
متن کاملStability and Generalization of Bipartite Ranking Algorithms
The problem of ranking, in which the goal is to learn a real-valued ranking function that induces a ranking or ordering over an instance space, has recently gained attention in machine learning. We study generalization properties of ranking algorithms, in a particular setting of the ranking problem known as the bipartite ranking problem, using the notion of algorithmic stability. In particular,...
متن کاملRanking algorithms for hierarchical similarity metrics
Case retrieval for e-commerce product recommendation is an application of CBR that demands particular attention to efficient implementation. Users expect quick response times from on-line catalogs, regardless of the underlying technology. In FindMe systems research, the cost of metric application has been a primary impediment to efficient retrieval. This paper describes several types of general...
متن کاملEmerging applications of link analysis for ranking
The booming growth of digitally available information has thoroughly increased the popularity of search engine technology over the past years. At the same time, upon interacting with this overwhelming quantity of data, people usually inspect only the very few most relevant items for their task. It is thus very important to utilize high quality ranking measures which efficiently identify these i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Internet Mathematics
سال: 2006
ISSN: 1542-7951,1944-9488
DOI: 10.1080/15427951.2006.10129130